A Metropolis-Type Optimization Algorithm on the Infinite Tree
نویسندگان
چکیده
منابع مشابه
A Metropolis - type Optimization Algorithm on theIn
Let S(v) be a function deened on the vertices v of the innnite binary tree. One algorithm to seek large positive values of S is the Metropolis-type Markov chain (X n) deened by P (X n+1 = wjX n = v) = 1 3 e b(S(w)?S(v)) 1 + e b(S(w)?S(v)) for each neighbor w of v, where b is a parameter (\1=temperature") which the user can choose. We introduce and motivate study of this algorithm under a probab...
متن کاملPerformance of the Metropolis algorithm on a disordered tree: the Einstein relation
Consider a d-ary rooted tree (d≥ 3) where each edge e is assigned an i.i.d. (bounded) random variable X(e) of negative mean. Assign to each vertex v the sum S(v) of X(e) over all edges connecting v to the root, and assume that the maximum S n of S(v) over all vertices v at distance n from the root tends to infinity (necessarily, linearly) as n tends to infinity. We analyze the Metropolis algori...
متن کاملOn a Directionally Adjusted Metropolis-Hastings Algorithm
We propose a new Metropolis-Hastings algorithm for sampling from smooth, unimodal distributions; a restriction to the method is that the target be optimizable. The method can be viewed as a mixture of two types of MCMC algorithm; specifically, we seek to combine the versatility of the random walk Metropolis and the efficiency of the independence sampler as found with various types of target dis...
متن کاملthe investigation of the relationship between type a and type b personalities and quality of translation
چکیده ندارد.
Improving on the Independent Metropolis-Hastings Algorithm
This paper proposes methods to improve Monte Carlo estimates when the Independent MetropolisHastings Algorithm (IMHA) is used. Our rst approach uses a control variate based on the sample generated by the proposal distribution. We derive the variance of our estimator for a xed sample size n and show that, as n tends to in nity, this variance is asymptotically smaller than the one obtained with t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1998
ISSN: 0178-4617
DOI: 10.1007/pl00009231